2-generated Cayley digraphs on nilpotent groups have hamiltonian paths

نویسنده

  • Dave Witte Morris
چکیده

Suppose G is a nilpotent, finite group. We show that if {a, b} is any 2-element generating set of G, then the corresponding Cayley digraph −−→ Cay(G; a, b) has a hamiltonian path. This implies that all of the connected Cayley graphs of valence ≤ 4 on G have hamiltonian paths.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Hamiltonian cycles and paths in Cayley graphs and digraphs - A survey

Cayley graphs arise naturally in computer science, in the study of word-hyperbolic groups and automatic groups, in change-ringing, in creating Escher-like repeating patterns in the hyperbolic plane, and in combinatorial designs. Moreover, Babai has shown that all graphs can be realized as an induced subgraph of a Cayley graph of any sufficiently large group. Since the 1984 survey of results on ...

متن کامل

On the Cayley Isomorphism Problem for Cayley Objects of Nilpotent Groups of Some Orders

We give a necessary condition to reduce the Cayley isomorphism problem for Cayley objects of a nilpotent or abelian group G whose order satisfies certain arithmetic properties to the Cayley isomorphism problem of Cayley objects of the Sylow subgroups of G in the case of nilpotent groups, and in the case of abelian groups to certain natural subgroups. As an application of this result, we show th...

متن کامل

On Hamilton Circuits in Cayley Digraphs over Generalized Dihedral Groups

In this paper we prove that given a generalized dihedral group DH and a generating subset S, if S∩H 6= ∅ then the Cayley digraph → Cay(DH , S) is Hamiltonian. The proof we provide is via a recursive algorithm that produces a Hamilton circuit in the digraph.

متن کامل

Hamilton paths in Cayley diagraphs of metacyclic groups

Curran, S.J., Hamilton paths in Cayley digraphs of metacyclic groups, Discrete Mathematics 115 (1993) 133-139. We obtain a characterization of all Hamilton paths in the Cayley digraph of a metacyclic group G with generating set {x, y} where (yx-‘) a G. The abundance of these Hamilton paths allows us to show that Hamilton paths occur in groups of at least two.

متن کامل

On trivial ends of Cayley graph of groups

‎In this paper, first we introduce the end of locally finite graphs as an equivalence class of infinite paths in the graph. Then we mention the ends of finitely generated groups using the Cayley graph. It was proved that the number of ends of groups are not depended on the Cayley graph and that the number of ends in the groups is equal to zero, one, two, or infinity. For ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Contributions to Discrete Mathematics

دوره 7  شماره 

صفحات  -

تاریخ انتشار 2012